Solving the Economic Lot Scheduling Problem with Deteriorating Items Using Genetic Algorithms

1.1 The background on the ELSP The Economic Lot Scheduling Problem (ELSP) is concerned with scheduling the cyclical production of n≥2 products on a single facility in lots that differ in size and, consequently, differ in production times and cycles. The cost items involved are: setup cost and inventory holding cost. A popular category of research for the ELSP is so-called “basic period-based cyclic schedule” which uses a basic period as the base for production planning and scheduling. A basic period B is an interval of time devoted to the setup and production of a subset of (or all) the products. A solution to the problem is usually given in the form of a set of multipliers K(B) = which implies that each product i's replenishment cycle T } | { 1 i B ki n